github.com/andybalholm/brotli/matchfinder.absoluteMatch.Start (field)

51 uses

	github.com/andybalholm/brotli/matchfinder (current package)
		emitter.go#L7: 	Start int
		emitter.go#L29: 		Unmatched: m.Start - e.NextEmit,
		emitter.go#L30: 		Length:    m.End - m.Start,
		emitter.go#L31: 		Distance:  m.Start - m.Match,
		m4.go#L60: 	return (m.End-m.Start)*256 + (bits.LeadingZeros32(uint32(m.Start-m.Match))-32)*q.DistanceBitCost
		m4.go#L116: 				if matches[1].End > matches[0].Start {
		m4.go#L117: 					matches[1].End = matches[0].Start
		m4.go#L119: 				if matches[1].End-matches[1].Start >= q.MinLength && q.score(matches[1]) > 0 {
		m4.go#L133: 				if m.End-m.Start >= q.MinLength {
		m4.go#L160: 			if m.End-m.Start > q.MinLength && q.score(m) > 0 {
		m4.go#L176: 				if m.End-m.Start > q.MinLength && q.score(m) > q.score(currentMatch) {
		m4.go#L182: 		if currentMatch.End-currentMatch.Start < q.MinLength {
		m4.go#L189: 			if currentMatch.Start <= matches[1].End {
		m4.go#L212: 		case matches[0].Start < matches[2].End:
		m4.go#L220: 		case matches[0].Start < matches[2].End+q.MinLength:
		m4.go#L232: 			if matches[2].End > matches[1].Start {
		m4.go#L233: 				matches[2].End = matches[1].Start
		m4.go#L234: 				if q.ChainLength > 0 && matches[2].End-matches[2].Start >= q.MinLength {
		m4.go#L237: 					pos := matches[2].Start
		m4.go#L247: 						if bytes.Equal(src[matches[2].Start:matches[2].End], src[pos:pos+matches[2].End-matches[2].Start]) {
		m4.go#L254: 			if matches[2].End-matches[2].Start >= q.MinLength && q.score(matches[2]) > 0 {
		m4.go#L263: 		if matches[1].End > matches[0].Start {
		m4.go#L264: 			matches[1].End = matches[0].Start
		m4.go#L266: 		if matches[1].End-matches[1].Start >= q.MinLength && q.score(matches[1]) > 0 {
		m4.go#L334: 		Start: start,
		pathfinder.go#L158: 			prevDistance := prevMatch.Start - prevMatch.Match
		pathfinder.go#L161: 				if m.End-m.Start > q.MinLength {
		pathfinder.go#L169: 			m := extendMatch2(src, i, candidate, max(historyLen, prevMatch.Start))
		pathfinder.go#L170: 			if m.End-m.Start > q.MinLength {
		pathfinder.go#L186: 				m := extendMatch2(src, i, candidate, max(historyLen, prevMatch.Start))
		pathfinder.go#L187: 				if m.End-m.Start > q.MinLength && m.End-m.Start > currentMatch.End-currentMatch.Start {
		pathfinder.go#L194: 		if i < prevMatch.End && currentMatch.End-currentMatch.Start <= prevMatch.End-prevMatch.Start {
		pathfinder.go#L215: 	slices.SortFunc(foundMatches, func(a, b absoluteMatch) int { return a.Start - b.Start })
		pathfinder.go#L243: 		for matchIndex < len(foundMatches) && foundMatches[matchIndex].Start == i {
		pathfinder.go#L250: 			if m.Start-m.Match != prevDistance {
		pathfinder.go#L251: 				matchCost += float32(bits.Len(uint(m.Start - m.Match)))
		pathfinder.go#L253: 			for j := m.Start + q.MinLength; j <= m.End; j++ {
		pathfinder.go#L255: 				if j-m.Start < 6 {
		pathfinder.go#L258: 					adjustedCost += float32(6-(j-m.Start)) * 2
		pathfinder.go#L263: 						length:   uint32(j - m.Start),
		pathfinder.go#L264: 						distance: uint32(m.Start - m.Match),
		pathfinder.go#L273: 		if unmatched == 0 && pending.Start != i && pending.End >= i+q.MinLength &&
		pathfinder.go#L274: 			!(arrivedHere.length != 0 && arrivedHere.distance == uint32(pending.Start-pending.Match)) {
		pathfinder.go#L275: 			matchCost := baseMatchCost + float32(bits.Len(uint(pending.Start-pending.Match)))
		pathfinder.go#L287: 						distance: uint32(pending.Start - pending.Match),